Gröbner basis for norm-trace codes
نویسندگان
چکیده
Heegard, Little and Saints worked out a Gröbner basis algorithm for Hermitian codes. Here we extend such a result for codes on Norm-Trace curves.
منابع مشابه
On Codes from Norm-Trace Curves
The main results of this paper are derived by using only simple Gröbner basis techniques. We present a new construction of evaluation codes from MiuraKamiya curves Cab. We estimate the minimum distance of the codes and estimate the minimum distance of a class of related one-point geometric Goppa codes. With respect to these estimates the new codes perform at least as well as the related geometr...
متن کاملOn parameters of subfield subcodes of extended norm-trace codes
In this article we describe how to find the parameters of subfield subcodes of extended Norm–Trace codes. With a Gröbner basis of the ideal of the Fqr rational points of the Norm–Trace curve one can determine the dimension of the subfield subcodes or the dimension of the trace code. We also find a BCH–like bound from the minimum distance of the original supercode. AMS Subject Classification: Pr...
متن کاملEfficient decoding of (binary) cyclic codes above the correction capacity of the code using Gröbner bases
This paper revisits the topic of decoding cyclic codes with Gröbner bases. We introduce new algebraic systems, for which the Gröbner basis computation is easier. We show that formal decoding formulas are too huge to be useful, and that the most efficient technique seems to be to recompute a Gröbner basis for each word (online decoding). We use new Gröbner basis algorithms and “trace preprocessi...
متن کاملGröbner Bases for Schubert Codes
We consider the problem of determining Gröbner bases of binomial ideals associated with linear error correcting codes. Computation of Gröbner bases of linear codes have become a topic of interest to many researchers in coding theory because of its several applications in decoding and error corrections. In this paper, Gröbner bases of linear codes associated to Grassmann varieties and Schubert v...
متن کاملGröbner Bases, Padé Approximation, and Decoding of Linear Codes
This paper shows how Gröbner basis techniques can be used in coding theory, especially in the construction and decoding of linear codes. A simple algorithm is given for computing the reduced Gröbner basis of the vanishing ideal of a given set of finitely many points, and it is used for finding Padé approximation of any polynomial (given implicitly), which is a major step in decoding. A new meth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Comput.
دوره 48 شماره
صفحات -
تاریخ انتشار 2013